A Regional Dynamic One-Dimensional Compaction Algorithm And Its Implementation 局域动态一维版图压缩算法及其实现
2-D Hierarchical Compaction Algorithm for VLSI Layout Reuse 面向VLSI版图复用技术的二维层次式压缩算法
Data compaction is an important technique of the computer science, prefix codes gained by using Huffman algorithm can make the total length of codes in the file shortest. 数据压缩是信息科学中的一项重要的技术,利用Huffman算法得到的前缀码可以使文件总编码长度最短。
Based on 〔 1 〕, this paper improves the resource reservation scheme and bandwidth compaction algorithm. 在参考文献〔1〕的基础上,对其提出的资源预留方案和带宽整理算法加以改进。
A general approach for node extraction of circuit layout and a node compaction method are given in this paper By defining node extraction procedure in technology file, the algorithm can extract nodes conveniently from all kinds of IC layouts 提出了一种版图电路节点提取及节点压缩算法。通过在工艺文件中设定节点生成过程,该方法能方便地提取各种版图电路节点
A.layout compaction system program which adopts RDOC algorithm is also introduced hero, and the design rules can be renewed ( increasing specific size or decreasing it) by the user where necessary. 本文还介绍了为实现该算法而开发的用于单元级版图的压缩程序,它允许用户按其需要对设计规则进行放大或缩小。
A Practical Layout Compaction Algorithm 实用版图压缩算法
Compared to one dimensional compaction, this algorithm gets better results and its time complexity is of the same order. 与一维紧缩比较起来,这种算法可获得更好的结果。而且其时间的复杂度具有同样的数量级。
A Model of Constraint Graph in Layout Compaction and Its Generation Algorithm 版图压缩中的约束图模型及其生成算法
This paper deeply analyzes the redundancy form of the routing table, and puts forward a compaction algorithm which does not change the routing semantic. It can compress the routing table well, reduce the energy consumption, and can also improve the routing speed. 本文深入分析路由规则的冗余形式,提出了一种规则集压缩算法,在不改变路由语义的情况下,可以较好地压缩路由规则,降低系统能耗,提高路由查找速度。